The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
نویسندگان
چکیده
منابع مشابه
On the Hamilton-Waterloo problem with triangle factors and C3x-factors
The Hamilton-Waterloo Problem (HWP) in the case of Cm-factors and Cn-factors asks whether Kv, where v is odd (or Kv − F , where F is a 1-factor and v is even), can be decomposed into r copies of a 2-factor made either entirely of m-cycles and s copies of a 2-factor made entirely of n-cycles. In this paper, we give some general constructions for such ∗ This work is supported by the Scientific an...
متن کاملThe Hamilton-waterloo Problem for Two Even Cycles Factors
This paper investigates the problem of factoring K2n − In into 2-factors of two kinds or three kinds: (1) Ct-factors and C2t-factors, (2) C4-factors and C2t-factors, (3) C4-factors, C8-factors and C16-factors.
متن کاملThe directed almost resolvable Hamilton-Waterloo problem
In this paper, a result is proved that provides a general method of attack that can be used to solve the existence problem for partitions of the directed edges of Dn, the complete directed graph on n. vertices into r and n r almost parallel classes of directed cycles of length m1 and m2 respectively in the case where n\ and, ?rl2 &r€ €v€r. Use of this technique is then demonstrated by essential...
متن کاملa case study of the two translators of the holy quran: tahereh saffarzadeh and laleh bakhtiar
بطورکلی، کتاب های مقدسی همچون قران کریم را خوانندگان میتوان مطابق با پیش زمینه های مختلفی که درند درک کنند. محقق تلاش کرده نقش پیش زمینه اجتماعی-فرهنگی را روی ایدئولوژی های مترجمین زن و در نتیجه تاثیراتش را روی خواندن و ترجمه آیات قرآن کریم بررسی کند و ببیند که آیا تفاوت های واژگانی عمده ای میان این مترجمین وجود دارد یا نه. به این منظور، ترجمه 24 آیه از آیات قرآن کریم مورد بررسی مقایسه ای قرار ...
15 صفحه اولThe Hamilton-Waterloo Problem with 4-Cycles and a Single Factor of n-Cycles
A 2-factor in a graph G is a 2-regular spanning subgraph of G, and a 2-factorization of G is a decomposition of all the edges of G into edge-disjoint 2-factors. A {Cr m,C n}-factorization of Kv asks for a 2-factorization of Kv , where r of the 2-factors consists of m-cycles, and s of the 2-factors consists of n-cycles. This is a case of the Hamilton-Waterloo problem with uniform cycle sizes m a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Designs
سال: 2009
ISSN: 1063-8539,1520-6610
DOI: 10.1002/jcd.20196